极大3限制边连通二部图的充分条件

设G=(V,E)是一个连通图.称一个边集合S■E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点.称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λ_k(G).定义ξ_k(G)=min{[X,■]:|X|=k,G[X]连通,■=V(G)\X}.称图G是极大k限制边连通的,如果λ_k(G)=ξ_k(G).本文给出了围长为g>6的极大3限制边连通二部图的充分条件.     

Fundamental Groups of Graphs of Cyclic Subgroup Separable and Weakly Potent Groups

We give a characterization of the cyclic subgroup separability and weak potency of the fundamental group of a graph of polycyclic-by-finite groups and free-by-finite groups amalgamating edge subgroups of the form × D,where h has infinite order and D is finite.     

关于两个图的一类新连接图的谱

给定2个图G1和G2，设G1的边集E(G1)={e1,e2,?,em1}，则图G1⊙G2可由一个G1，m1个G2通过在G1对应的每条边外加一个孤立点，新增加的点记为U={u1,u2,?,um1}，将ui分别与第i个G2的所有点以及G1中的边ei的端点相连得到，其中i=?1,2,?,m1。得到：（i）当G1是正则图，G2是正则图或完全二部图时，确定了G1⊙G2的邻接谱（A-谱）。（ii）当G1是正则图，G2是任意图时，给出了G1⊙G2的拉普拉斯谱（L-谱）。（iii）当G1和G2都是正则图时，给出了G1⊙G2的无符号拉普拉斯谱（Q-谱）。作为以上结论的应用，构建了无限多对A-同谱图、L-同谱图和Q-同谱图；同时当G1是正则图时，确定了G1⊙G2支撑树的数量和Kirchhoff指数。     

Optimisation of the ultrasound-assisted extraction of betalains and polyphenols from Amaranthus hypochondriacus var. Nutrisol

The present study optimised the ultrasound-assisted extraction (UAE) of bioactive compounds from Amaranthus hypochondriacus var. Nutrisol. Influence of temperature (25.86–54.14 °C) and ultrasonic power densities (UPD) (76.01–273.99 mW/mL) on total betalains (BT), betacyanins (BC), betaxanthins (BX), total polyphenols (TP), antioxidant activity (AA), colour parameters (L*, a*, and b*), amaranthine (A), and isoamaranthine (IA) were evaluated using response surface methodology. Moreover, betalain extraction kinetics and mass transfer coefficients (K_La) were determined for each experimental condition. BT, BC, BX, TP, AA, b*, K_La, and A were significantly affected (p < 0.05) by temperature extraction and UPD, whereas L*, a*, and IA were only affected (p < 0.05) by temperature. All response models were significantly validated with regression coefficients (R²) ranging from 87.46 to 99.29%. BT, A, IA, and K_La in UAE were 1.38, 1.65, 1.50, and 29.93 times higher than determined using conventional extraction, respectively. Optimal UAE conditions were obtained at 41.80 °C and 188.84 mW/mL using the desired function methodology. Under these conditions, the experimental values for BC, BX, BT, TP, AA, L*, a*, b*, K_La, A, and IA were closely related to the predicted values, indicating the suitability of the developed quadratic models. This study proposes a simple and efficient UAE method to obtain betalains and polyphenols with high antioxidant activity, which can be used in several applications within the food industry.     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.